Efficient Surrogate Assisted Optimization for Constrained Black-Box Problems
نویسندگان
چکیده
Modern real-world optimization problems are often high dimensional and subject to many constraints. These problems are typically expensive in terms of cost and computational time. In order to optimize such problems, conventional constraintbased solvers require a high number of function evaluations which are not affordable in practice. Employment of fast surrogate models to approximate objective and constraint functions is a known approach for efficient optimization. The performance of the RBF interpolation is not dependent on the dimensionality of the optimization tasks. This is why in the area of surrogate-assisted optimization a lot of attention is devoted to RBF modeling. As an example for such a solver, COBRA is a constrained based efficient optimizer that outperforms many other algorithms on a large number of benchmarks. COBRA-R is a variant of COBRA extended with several algorithms such as a different initialization method and a novel repair technique. In this thesis, after investigating the strengths and weaknesses of COBRA-R, we introduced several extensions to enhance the overall performance of COBRA-R. Our investigation showed that the RBF surrogates cannot provide a suitable model for steep functions. Therefore, problems with steep objective or constraint functions have to be modified in order to be optimized with the COBRA-R approach. Additionally, the performance of COBRA-R is highly sensitive to the correct selection of a parameter called DRC. Also, the surrogate models appeared to be wrong for the problems with highly varying input ranges. Moreover, it was observed that sometimes a bad initial design could cause an early stagnation. The extended COBRA-R called self-adaptive COBRA-R intends to overcome these mentioned obstacles by including three extra steps: 1. Rescaling the input space to [0, 1] (if it is necessary). 2. Automatic parameter/function(s) adaptation according to the information gained from the initial population. 3. Random start mechanism to avoid occasional bad solutions due to a few unfortunate initial designs. We evaluate our approach by using 11 G-problems and a high dimensional automotive problem (MOPTA08) as benchmark. We also report negative results where SACOBRA-R still shows a bad behavior and gives indications for possible improvements.
منابع مشابه
Solving the G-problems in less than 500 iterations: Improved efficient constrained optimization by surrogate modeling and adaptive parameter control
Constrained optimization of high-dimensional numerical problems plays an important role in many scientific and industrial applications. Function evaluations in many industrial applications are severely limited and no analytical information about objective function and constraint functions is available. For such expensive black-box optimization tasks, the constraint optimization algorithm COBRA ...
متن کاملSurrogate Constraint Functions for CMA Evolution Strategies
Many practical optimization problems are constrained black boxes. Covariance Matrix Adaptation Evolution Strategies (CMA-ES) belong to the most successful black box optimization methods. Up to now no sophisticated constraint handling method for Covariance Matrix Adaptation optimizers has been proposed. In our novel approach we learn a meta-model of the constraint function and use this surrogate...
متن کاملSurrogate-assisted evolutionary computation: Recent advances and future challenges
Surrogate-assisted, or meta-model based evolutionary computation uses efficient computational models, often known as surrogates or meta-models, for approximating the fitness function in evolutionary algorithms. Research on surrogate-assisted evolutionary computation began over a decade ago and has received considerably increasing interest in recent years. Very interestingly, surrogate-assisted ...
متن کاملStochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
Optimization Involving Expensive Black-Box Objective and Constraint Functions Rommel G. Regis Mathematics Department, Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] August 23, 2010 Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-box objective functions subject to expensive black-box inequality constraints. The proposed al...
متن کاملSO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
This paper introduces a surrogate model based algorithm for computationally expensive mixed-integer black-box global optimization problems that may have computationally expensive constraints. The goal is to find accurate solutions with relatively few function evaluations. A radial basis function surrogate model (response surface) is used to select candidates for integer and continuous decision ...
متن کامل